منابع مشابه
Bounds from a card trick
We describe a new variation of a mathematical card trick, whose analysis leads to new lower bounds for data compression and estimating the entropy of Markov sources.
متن کاملOn the Mathematical Background of Gilbreath's Card Trick
In Martin Gardner's book \New mathematical diversions from Scientiic American" it is described how certain information concerning the initial distribution of a deck of cards survives an arbitrarily thorough riie shuue. This gives rise to a card trick which is attributed to Norman Gilbreath, several other tricks presented in magic journals are based on the same principle. Here we aim to generali...
متن کاملThe Importance of Rank in Trick-Taking Card Games
Recent years have seen a surge of interest in computational complexity results in card games. We focus in this paper on trick-taking card games, extending a study started in 2013. This class ranges from WHIST and CONTRACT BRIDGE to SKAT and TAROT. We investigate how the number of cards per suit, the ranks, impacts the complexity of solving arbitrary positions. We prove that 2 distinct ranks are...
متن کاملReal-Time Opponent Modeling in Trick-Taking Card Games
As adversarial environments become more complex, it is increasingly crucial for agents to exploit the mistakes of weaker opponents, particularly in the context of winning tournaments and competitions. In this work, we present a simple post processing technique, which we call Perfect Information Post-Mortem Analysis (PIPMA), that can quickly assess the playing strength of an opponent in certain ...
متن کاملOn the Complexity of Trick-Taking Card Games
Determining the complexity of perfect information trick-taking card games is a long standing open problem. This question is worth addressing not only because of the popularity of these games among human players, e.g., DOUBLE DUMMY BRIDGE, but also because of its practical importance as a building block in state-of-the-art playing engines for CONTRACT BRIDGE, SKAT, HEARTS, and SPADES. We define ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Discrete Algorithms
سال: 2012
ISSN: 1570-8667
DOI: 10.1016/j.jda.2011.08.001